Abstraction and Control for Shapely Nested Graph Transformation

Abstraction and Control for Shapely Nested Graph Transformation

Shapely Hierarchical Graph Transformation

Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles t...

From Graph Transformation to Rule-Based Programming with Diagrams

Graph transformation is a well studied computational model for speciication and programming. In this paper we outline a path that can be taken in order to turn graph transformation into a rule-based language for programming with diagrams. In particular, we discuss how data abstraction and functional abstraction can be achieved in the setting of graphs, by minimal extensions of the underlying gr...

Hoare-Style Verification of Graph Programs

GP (for Graph Programs) is an experimental nondeterministic programming language for solving problems on graphs and graph-like structures. The language is based on graph transformation rules, allowing visual programming at a high level of abstraction. In particular, GP frees programmers from dealing with low-level data structures. In this paper, we present a Hoare-style proof system for verifyi...

Context-exploiting Shapes for Diagram Transformation

DIAPLAN is a language for programming with graphs representing diagrams that is currently being developed. The computational model of the languages, nested graph transformation, supports nested structuring of graphs, and graph variables, but is—hopefully—still intuitive. This paper is about structural typing of nested graphs and nested graph transformation systems by shape rules. We extend the ...